A Modified Linear Sampling Method Valid for all Frequencies and an Application to the Inverse Inhomogeneous Medium Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA new method for solving the inverse scattering problem for acoustic waves in an inhomogeneous medium
A new method is presented for solving the inverse scattering problem of determining the speed of sound in an inhomogeneous medium from the far-field data. If F (a; k , 6 ) are the far-field data corresponding to an incident plane wave with wavenumber k moving in the direction & and F j , ( f ; k , &) are the far-field data for a ball no containing the inhomogeneous region and satisfying an impe...
متن کاملA modified VIM for solving an inverse heat conduction problem
In this paper, we will use a modified variational iteration method (MVIM) for solving an inverse heat conduction problem (IHCP). The approximation of the temperature and the heat flux at are considered. This method is based on the use of Lagrange multipliers for the identification of optimal values of parameters in a functional in Euclidian space. Applying this technique, a rapid convergent s...
متن کاملApplication of modified simplex method to biomagnetic inverse problem
Difficulty in determination of source brain activities for observed biomagnetic signals (magnetoencephalograms, MEGs) is known as the biomagnetic inverse problem. Moving Dipole Method [1] has been developed for solution of this problem. Two difficulties have been pointed out for this approach. The first problem is that the number of sources must be known before the analysis. However, it is diff...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2005
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200510320